Application of Harmony Search to Vehicle Routing
نویسندگان
چکیده
منابع مشابه
Local Search in Constraint Programming : Application to the Vehicle Routing
Constraint programming is an appealing technology to use for vehicle routing problems. Traditional linear programming models do not have the exibility or generality required by businesses wishing to model complex side constraints. This paper describes how a constraint programming framework for vehicle routing problems was implemented using ILOG Solver. A method for incorporating local search in...
متن کاملApplication of harmony search algorithm to evaluate performance of diamond wire saw
Evaluation and prediction of performance of diamond wire saw is one of the most important factors involved in planning the dimension stone quarries. The wear rate of diamond wire saw can be investigated as a major criterion to evaluate its performance. The wear rate of diamond wire saw depends upon non-controlled parameters related to rock characteristics and controlled parameters related to ch...
متن کاملdisaster relief vehicle routing with covering tour approach and fuzzy demands, solved by hybrid harmony search algorithm
one of the most important measures needed to be done in times of crisis is to optimize the allocation and distribution of resources among individuals. time is a critical factor effective to increase the number of people rescued by the relief activities.in this paper, we present a relief vehicle routing model in the affected area which uses covering tour approach to reduce total response time. a...
متن کاملThe Special Application of Vehicle Routing Problem with Uncertainty Travel Times: Locomotive Routing Problem
This paper aims to study the locomotive routing problem (LRP) which is one of the most important problems in railroad scheduling in view of involving expensive assets and high cost of operating locomotives. This problem is assigning a fleet of locomotives to a network of trains to provide sufficient power to pull them from their origins to destinations by satisfying a rich set of operational con...
متن کاملAn Improved Modified Tabu Search Algorithm to Solve the Vehicle Routing Problem with Simultaneous Pickup and Delivery
The vehicle routing problem with simultaneous pickup and delivery (VRPSPD) is a well-known combinatorial optimization problem which addresses provided service to a set of customers using a homogeneous fleet of capacitated vehicles. The objective is to minimize the distance traveled. The VRPSPD is an NP-hard combinatorial optimization problem. Therefore, practical large-scale instances of VR...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: American Journal of Applied Sciences
سال: 2005
ISSN: 1546-9239
DOI: 10.3844/ajassp.2005.1552.1557